Automated Refactoring from Synchronized Locks to Reentrant Locks

Reasoning about Java's Reentrant Locks

This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permissionaccounting separation logic. As usual, each lock is associated with a resource invariant, i.e., when acquiring the lock the resources are obtained by the thread holding the lock, and when releasing the lock, the resources are released. To accomm...

Transactional Mutex Locks

Mutual exclusion (mutex) locks limit concurrency but offer low single-thread latency. Software transactional memory (STM) typically has much higher latency, but scales well. We present transactional mutex locks (TML), which attempt to achieve the best of both worlds for read-dominated workloads. We also propose compiler optimizations that reduce the latency of TML to within a small fraction of ...

Light-weight Locks

In this paper, we propose a new approach to building synchronization primitives, dubbed “lwlocks” (short for light-weight locks). The primitives are optimized for small memory footprint while maintaining efficient performance in low contention scenarios. A read-write lwlock occupies 4 bytes, a mutex occupies 4 bytes (2 if deadlock detection is not required), and a condition variable occupies 4 ...

RETROSPECTIVE: Thin Locks

Crm1 locks up replication factors

e already knew the players—MgcRacGAP, Aurora B, and RhoA—and that knocking out any one of them caused failure of cytokinesis; but it wasn’t clear how they were connected. Now, it appears that Aurora B phosphorylates the GAP domain of MgcRacGAP, allowing it to turn its GAP activity toward RhoA, according to data from Yukinori Minoshima, Toshiyuki Kawashima, Toshio Kitamura (University of Tokyo, ...